Clustering Credit Card Holder Berdasarkan Pembayaran Tagihan Menggunakan Improved K-Means dengan Particle Swarm Optimization
نویسندگان
چکیده
منابع مشابه
Particle Swarm Optimization Algorithm Based k-means and Fuzzy c-means clustering
Data mining is the process of extracting hidden patterns from huge data. Among the various clustering algorithms, k-means is the one of most widely used clustering technique in data mining. The performance of k-means clustering depends on the initial clusters and might converge to local optimum. K-means does not guarantee the unique clustering because it generates different results with randoml...
متن کاملThe K-means Clustering Algorithm Based on Chaos Particle Swarm
Proposed the Algorithm of K-means (CPSOKM) based on Chaos Particle Swarm in order to solve the problem that K-means algorithm sensitive to initial conditions and is easy to influence the clustering effect. On the selection of the initial value problem, algorithm using particle swarm algorithm to balance the random value uncertainty, and then by introducing a chaotic sequence, the particles move...
متن کاملA Particle Swarm Optimization Based Chaotic K-means Evolutionary Approach
The proposed approach brings up a manner of cognitiveness that inherits a paradigm in particle swarm optimization to implement a chaotic mapping and enhanced by K-means clustering algorithm. In this work, named KCPSO, chaotic mapping with ergodicity, irregularity and the stochastic properties in PSO contributes to global search while K-means with clustering properties in PSO results in rapid co...
متن کاملA hybrid sequential approach for data clustering using K-Means and particle swarm optimization algorithm
Clustering is a widely used technique of finding interesting patterns residing in the dataset that are not obviously known. The K-Means algorithm is the most commonly used partitioned clustering algorithm because it can be easily implemented and is the most efficient in terms of the execution time. However, due to its sensitiveness to initial partition it can only generate a local optimal solut...
متن کاملParticle Swarm Optimization based K-Prototype Clustering Algorithm
Clustering in data mining is a discovery process that groups a set of data so as to maximize the intracluster similarity and to minimize the inter-cluster similarity. The K-Means algorithm is best suited for clustering large numeric data sets when at possess only numeric values. The K-Modes extends to the K-Means when the domain is categorical. But in some applications, data objects are describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknologi Informasi dan Ilmu Komputer
سال: 2018
ISSN: 2528-6579,2355-7699
DOI: 10.25126/jtiik.201856858